Errors in Low and Lapsley's article "Optimization Flow Control, I: Basic Algorithm and Convergence"

نویسنده

  • Andrzej Karbowski
چکیده

In the note two errors in Low and Lapsley's article [1] are shown. Because of these errors the proofs of both theorems presented in the article are incomplete and some assessments are wrong. In the proof of Lemma 3 (at the beginning) on the page 871 it is written: " Given any p, q ≥ 0, using Taylor theorem and Lemma 2 we have ∇D(q)−∇D(p) = ∇ 2 D(w)(q −p) = [...] for some w = tp + (1 − t)q ≥ 0, t ∈ [0, 1]. " The problem is, that the mentioned Taylor theorem, or rather multidimensional mean value theorem, is not true. Here is the counterexample:

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Correction to Low and Lapsley's article "Optimization Flow Control, I: Basic Algorithm and Convergence"

In the note an error in Low and Lapsley’s article [1] is pointed out. Because of this error the proof of the Theorem 2 presented in the article is incomplete and

متن کامل

Designing an adaptive fuzzy control for robot manipulators using PSO

This paper presents designing an optimal adaptive controller for tracking control of robot manipulators based on particle swarm optimization (PSO) algorithm. PSO algorithm has been employed to optimize parameters of the controller and hence to minimize the integral square of errors (ISE) as a performance criteria. In this paper, an improved PSO using logic is proposed to increase the convergenc...

متن کامل

Improved teaching–learning-based and JAYA optimization algorithms for solving flexible flow shop scheduling problems

Flexible flow shop (or a hybrid flow shop) scheduling problem is an extension of classical flow shop scheduling problem. In a simple flow shop configuration, a job having ‘g’ operations is performed on ‘g’ operation centres (stages) with each stage having only one machine. If any stage contains more than one machine for providing alternate processing facility, then the problem...

متن کامل

Optimizing Cost Function in Imperialist Competitive Algorithm for Path Coverage Problem in Software Testing

Search-based optimization methods have been used for software engineering activities such as software testing. In the field of software testing, search-based test data generation refers to application of meta-heuristic optimization methods to generate test data that cover the code space of a program. Automatic test data generation that can cover all the paths of software is known as a major cha...

متن کامل

Control of nonlinear systems using a hybrid APSO-BFO algorithm: An optimum design of PID controller

This paper proposes a novel hybrid algorithm namely APSO-BFO which combines merits of Bacterial Foraging Optimization (BFO) algorithm and Adaptive Particle Swarm Optimization (APSO) algorithm to determine the optimal PID parameters for control of nonlinear systems. To balance between exploration and exploitation, the proposed hybrid algorithm accomplishes global search over the whole search spa...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره cs.NI/0209024  شماره 

صفحات  -

تاریخ انتشار 2002